A general approach for studying duality in multiobjective optimization

نویسندگان

  • Radu Ioan Bot
  • Sorin-Mihai Grad
  • Gert Wanka
چکیده

A general duality framework in convex multiobjective optimization is established using the scalarization with K-strongly increasing functions and the conjugate duality for composed convex cone-constrained optimization problems. Other scalarizations used in the literature arise as particular cases and the general duality is specialized for some of them, namely linear scalarization, maximum(-linear) scalarization, set scalarization, (semi)norm scalarization and quadratic scalarization.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Benson's algorithm for nonconvex multiobjective problems via nonsmooth Wolfe duality

‎In this paper‎, ‎we propose an algorithm to obtain an approximation set of the (weakly) nondominated points of nonsmooth multiobjective optimization problems with equality and inequality constraints‎. ‎We use an extension of the Wolfe duality to construct the separating hyperplane in Benson's outer algorithm for multiobjective programming problems with subdifferentiable functions‎. ‎We also fo...

متن کامل

An Analysis of Some Dual Problems in Multiobjective Optimization (ii)

In the first part of this study we have introduced six different multiobjective dual problems to a general multiobjective optimization problem, for which we presented weak as well as strong duality assertions. Afterwards, we derived some inclusion results for the image sets of three of these problems. The aim of this second part is to complete our investigations by studying the relations betwee...

متن کامل

A note on symmetric duality in vector optimization problems

In this paper, we establish weak and strong duality theorems for a pair of multiobjective symmetric dual problems. This removes several omissions in the paper "Symmetric and self duality in vector optimization problem, Applied Mathematics and Computation 183 (2006) 1121-1126".

متن کامل

An Analysis of Some Dual Problems in Multiobjective Optimization (i)

In this work we study the duality for a general multiobjective optimization problem. Considering, first, a scalar problem, different duals using the conjugacy approach are presented. Starting from these scalar duals, we introduce six different multiobjective dual problems to the primal one, one depending on certain vector parameters. The existence of weak and, under certain conditions, of stron...

متن کامل

Duality for the class of a multiobjective problem with support functions under $K$-$G_f$-invexity assumptions

‎In this article‎, ‎we formulate two dual models Wolfe and Mond-Weir related to symmetric nondifferentiable multiobjective programming problems‎. ‎Furthermore‎, ‎weak‎, ‎strong and converse duality results are established under $K$-$G_f$-invexity assumptions‎. ‎Nontrivial examples have also been depicted to illustrate the theorems obtained in the paper‎. ‎Results established in this paper unify...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Math. Meth. of OR

دوره 65  شماره 

صفحات  -

تاریخ انتشار 2007